Graph Cutting Tumor Images

نویسندگان

  • Christo Ananth
  • Shivangi Singh
چکیده

A new proposed method of fully automatic processing frameworks is based on graph-cut active contour algorithms. This paper addresses the problem of segmenting a liver and tumor regions from the abdominal CT images. A predicate is defined for measuring the evidence for a boundary between two regions using a Graph-based representation of the image. The algorithm is applied to image segmentation using two different kinds of local neighborhoods in constructing the graph. Liver and Hepatic Tumor Segmentation can be automatically processed by the graph-cut based method. This system has concentrated on finding a fast and interactive segmentation method for liver and tumor segmentation. In preprocessing stage, the CT image process with mean shift filter and statistical thresholding method for reducing processing area with improving detections rate. Second stage is liver segmentation; the liver region has been segmented using the algorithm of the proposed method. The next stage tumor segmentation also followed the same steps. Finally the liver and tumor regions are separately segmented from the computer tomography image. Keywords— Automatic segmentation; graph-cuts; gradient vector flow (GVF) active contours; hepatic tumors and

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of methods of co-segmentation on PET/CT images of lung tumor: simulation study

Introduction: Lung cancer is one of the most common causes of cancer-related deaths worldwide. Nowadays PET/CT plays an essential role in radiotherapy planning specially for lung tumors as it provides anatomical and functional information simultaneously that is effective in accurate tumor delineation. The optimal segmentation method has not been introduced yet, however several ...

متن کامل

Joint Cuts and Matching of Partitions in One Graph

As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives few attention. In this paper, we first formalize the problem of simultaneously cutting a graph into two partitions i.e. graph cuts and establishing their cor...

متن کامل

Segmentation of Magnetic Resonance Brain Imaging Based on Graph Theory

Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...

متن کامل

An Efficient Parallel Algorithm for Graph-Based Image Segmentation

Automatically partitioning images into regions (‘segmentation’) is challenging in terms of quality and performance. We propose a Minimum Spanning Tree-based algorithm with a novel graph-cutting heuristic, the usefulness of which is demonstrated by promising results obtained on standard images. In contrast to data-parallel schemes that divide images into independently processed tiles, the algori...

متن کامل

Estimating Tumor/Non-Tumor Uptake from Radiolabeled Monoclonal Antibodies using Scintigraphic Images and Dissecting the Animal Models

Introduction: Biodistribution study in animal models bearing tumors is one of the most important procedures in evaluation of fractional uptake of radiopharmaceuticals in the tumor and non-tumor organs. The aim of this study was to develop a new software-based method to determine activities that accumulate in the main organs as well as the tumor based on scintigraphy images, thereby obviating th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014